On the maximum cardinality of binary constant weight codes with prescribed distance
نویسندگان
چکیده
منابع مشابه
Heuristic Construction of Constant Weight Binary Codes
Constant weight binary codes are used in a number of applications. The most fully developed treatment of these codes in the literature is restricted to codes of length at most 28. Only recently have comprehensive results been presented for longer codes. Constructions based on mathematical structure are known for many of the shorter codes. However, such constructions are rarer for lengths greate...
متن کاملSix New Constant Weight Binary Codes
We give six improved bounds on A(n, d, w), the maximum cardinality of a binary code of length n with minimum distance d and constant weight w.
متن کاملSome new distance-4 constant weight codes
Improved binary constant weight codes with minimum distance 4 and length at most 28 are constructed. A table with bounds on the chromatic number of small Johnson graphs is given.
متن کاملNew explicit binary constant weight codes from Reed-Solomon codes
Binary constant weight codes have important applications and have been studied for many years. Optimal or near-optimal binary constant weight codes of small lengths have been determined. In this paper we propose a new construction of explicit binary constant weight codes from q-ary ReedSolomon codes. Some of our binary constant weight codes are optimal or new. In particular new binary constant ...
متن کاملTrellis-Coded Quantization Based on Maximum-Hamming-Distance Binary Codes
Most design approaches for trellis-coded quantization take advantage of the duality of trellis-coded quantization with trellis-coded modulation, and use the same empiricallyfound convolutional codes to label the trellis branches. This letter presents an alternative approach that instead takes advantage of maximum-Hamming-distance convolutional codes. The proposed source codes are shown to be co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90430-a